Neighborly partitions and the numerators of Rogers–Ramanujan identities
نویسندگان
چکیده
We prove two partition identities which are dual to the Rogers–Ramanujan identities. These inspired by (and proved using) a correspondence between three kinds of objects: new type partitions (neighborly partitions), monomial ideals and some infinite graphs.
منابع مشابه
Polynomial identities for partitions
For any partition λ of an integer n , we write λ =< 11, 22, . . . , nn > where mi(λ) is the number of parts equal to i . We denote by r(λ) the number of parts of λ (i.e. r(λ) = ∑n i=1mi(λ) ). Recall that the notation λ ` n means that λ is a partition of n . For 1 ≤ k ≤ N , let ek be the k-th elementary symmetric function in the variables x1, . . . , xN , let hk be the sum of all monomials of to...
متن کاملOn the identities of modulo-p partitions
Some identities between partitions and compositions were obtained in the literature. As a natural extension, we introduce and study modulo-p partitions, where p is a positive integer. Moreover, several recurrence relations and some sufficient conditions for the existence of modulo-p partitions are given, respectively. In addition, we obtain some identities of modulo-p partitions. In the end, us...
متن کاملActions and Identities on Set Partitions
A labeled set partition is a partition of a set of integers whose arcs are labeled by nonzero elements of an abelian group A. Inspired by the action of the linear characters of the unitriangular group on its supercharacters, we define a group action of An on the set of A-labeled partitions of an (n + 1)-set. By investigating the orbit decomposition of various families of set partitions under th...
متن کاملIdentities for Schur Functions and Plane Partitions
By a plane partition, we mean a finite set, P , of lattice points with positive integer coefficients, {(i, j, k)} ⊆ N, with the property that if (r, s, t) ∈ P and 1 ≤ i ≤ r, 1 ≤ j ≤ s, 1 ≤ k ≤ t, then (i, j, k) must also be in P . A plane partition is symmetric if (i, j, k) ∈ P if and only if (j, i, k) ∈ P . The height of stack (i, j) is the largest value of k for which there exists a point (i,...
متن کاملJack Polynomials and Some Identities for Partitions
We prove an identity about partitions involving new combinatorial coefficients. The proof given is using a generating function. As an application we obtain the explicit expression of two shifted symmetric functions, related with Jack polynomials. These quantities are the moments of the “α-content” random variable with respect to some transition probability distributions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Number Theory
سال: 2022
ISSN: ['1793-7310', '1793-0421']
DOI: https://doi.org/10.1142/s1793042123500434